On the Tractability of Terminological Logics with Numerical Restrictions
نویسندگان
چکیده
A number of results relative to the complexity of terminological logics have recently appeared in the literature. Unfortunately, most of these results are “negative”, as they show that, in the logics they refer to, deciding subsumption is intractable. In this paper we show that computing subsumption is O(n2) in B∇ac〈ma\∀4N−, a logic obtained by adding the two operators atleast and atmost, which allow the specification of number restrictions, to Brachman and Levesque’s B∇ac〈ma\∀4− logic.
منابع مشابه
Adding Number Restrictions to a Four-Valued Terminological Logic
An intuitive four-valued semantics can be used to develop expressively powerful terminological logits which have tractable subsumption. If a fourvalued identity is also used, number restrictions can be added to the logic while retaining tracts bility. The subsumptions supported by the logic are a type of “structural” subsumption, where each structural component of one concept must have an analo...
متن کاملOn the numerical solution of integral equations of the fourth kind with higher index: differentiability and tractability index-3
In this paper, we consider a particular class of integral equations of the fourth kind and show that tractability and differentiability index of the given system are 3. Tractability and dierentiability index are introduced based on the-smoothing property of a Volterra integral operator and index reduction procedure, respectively. Using the notion of index, we give sucient conditions for the exi...
متن کاملTerminological Cycles in a Description Logic with Existential Restrictions
Cyclic definitions in description logics have until now been investigated only for description logics allowing for value restrictions. Even for the most basic language which allows for conjunction and value restrictions only, deciding subsumption in the presence of terminological cycles is a PSPACE-complete problem. This paper investigates subsumption in the presence of terminological cycles fo...
متن کاملA Computationally Tractable Terminological Logic
Terminological Logics are knowledge representation formalisms of enormous applicative interest, as they are specifically oriented to the vast class of application domains that are describable by means of taxonomic organizations of complex objects. A number of results relative to the computational complexity of terminological logics have recently appeared in the literature. Unfortunately, most o...
متن کاملRestricted Role-value-maps in a Description Logic with Existential Restrictions and Terminological Cycles
In a previous paper we have investigated subsumption in the presence of terminological cycles for the description logic EL, which allows conjunctions, existential restrictions, and the top concept, and have shown that the subsumption problem remains polynomial for all three types of semantics usually considered for cyclic definitions in description logics. In this paper we show that subsumption...
متن کامل